Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads
نویسندگان
چکیده
منابع مشابه
Large Neighborhood-Based Metaheuristic and Branch-and-Price for the Pickup and Delivery Problem with Split Loads
We consider the multi-vehicle one-to-one pickup and delivery problem with split loads, a NP-hard problem linked with a variety of applications for bulk product transportation, bike-sharing systems and inventory re-balancing. This problem is notoriously difficult due to the interaction of two challenging vehicle routing attributes, “pickups and deliveries” and “split deliveries”. This possibly l...
متن کاملThe Pickup and Delivery Problem with Split Loads
ACKNOWLEDGEMENTS While working on my Ph.D. at Georgia Tech and Michigan, I have received a great deal of support from many different people. My degree would not have been possible without this support. I would like to begin by thanking my two dissertation advisors, Dr. Ozlem Ergun and Dr. Chip White. Their guidance and encouragement was constant and unwavering. They helped open the door for me ...
متن کاملPickup and Delivery with Split Loads
Splitting loads such that the delivery of certain loads is completed in multiple trips rather than one trip results in opportunities for a reduction in cost and the number of vehicles used. Several studies have shown the benefit of split deliveries for the Vehicle Routing Problem, in which a vehicle operating out of a depot makes a series of deliveries on each route. In this paper, we quantify ...
متن کاملBranch and Cut and Price for the Pickup and Delivery Problem with Time Windows
In the pickup and delivery problem with time windows (PDPTW), vehicle routes must be designed to satisfy a set of transportation requests, each involving a pickup and a delivery location, under capacity, time window, and precedence constraints. This paper introduces a new branch-and-cut-and-price algorithm in which lower bounds are computed by solving through column generation the linear progra...
متن کاملA branch-and-price algorithm for the pickup and delivery problem with time windows
In pickup and delivery problems vehicles have to transport loads from origins to destinations without transshipment at intermediate locations. In this paper, we describe an algorithm to solve such problems. The algorithm is based on a set partitioning formulation of the problem and uses new column generation and branching schemes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2018
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2018.04.017